An options-based solution to the sequential auction problem

نویسندگان

  • Adam I. Juda
  • David C. Parkes
چکیده

The sequential auction problem is commonplace in open, electronic marketplaces such as eBay. This problem occurs when a buyer faces a complex strategic problem in bidding across multiple auctions, each selling similar or essentially identical items and when the buyer would have a simple, truth-revealing strategy if there was but a single auction event. Our model allows for multiple, distinct goods and market dynamics with buyers and sellers that arrive over time. Sellers each bring a single unit of a good to the market while buyers can have values on bundles of goods. We model each individual auction as a second-price (Vickrey) auction and propose an options-based, proxied solution to provide price and winner-determination coordination across auctions. While still allowing for temporally uncoordinated market participation, this options-based approach solves the sequential auction problem and provides a market in which truthful bidding is a weakly dominant strategy for buyers. An empirical study suggests that this coordination can enable a significant efficiency and revenue improvement over the current eBay market design, and highlights the various effects on performance of complex buyer valuations (buyers with substitutes and complements valuations) and in varying the market liquidity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Selecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction

In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...

متن کامل

Sequential Optimality Conditions and Variational Inequalities

In recent years, sequential optimality conditions are frequently used for convergence of iterative methods to solve nonlinear constrained optimization problems. The sequential optimality conditions do not require any of the constraint qualications. In this paper, We present the necessary sequential complementary approximate Karush Kuhn Tucker (CAKKT) condition for a point to be a solution of a ...

متن کامل

Flexibly Priced Options: A New Mechanism for Sequential Auctions with Complementary Goods

In this paper we present a novel option pricing mechanism for reducing the exposure problem encountered by bidders with complementary valuations when participating in sequential, second-price auction markets. Existing option pricing models have two main drawbacks: they either apply a fixed exercise price, which may deter bidders with low valuations, thereby decreasing allocative efficiency, or ...

متن کامل

Development of a Genetic Algorithm for Advertising Time Allocation Problems

Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinatorial auction based mathematical model. This is a...

متن کامل

Pricing in Dynamic Vehicle Routing Problems

The principal focus of this paper is to study carrier pricing decisions for a type of vehicle routing problems defined in a competitive and dynamic environment. This paper introduces the Vehicle Routing Problem in a Competitive Environment (VRPCE), as an extension of the Traveling Salesman Problem with Profits (TSPP) to a dynamic competitive auction environment. In the VRPCE, the carrier must e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Artif. Intell.

دوره 173  شماره 

صفحات  -

تاریخ انتشار 2009